Finding Worst-Case Flexible Schedules using Coevolution
نویسنده
چکیده
Finding flexible schedules is important to industry, since in many environments changes such as machine breakdowns or the appearance of new jobs can happen at short notice. In this paper a minimax formulation is used to develop a coevolutionary algorithm for finding worst case flexible schedules. A population of schedules is used to locate the schedule with the best worst case performance, while a population of breakdowns is used to locate the worst breakdown and estimate the performance of the schedules. This approach is compared to a standard scheduling approach and concluded to produce more flexible schedules. It is also compared to an approach in which the schedules are tested against all possible breakdowns; the coevolutionary approach is found to be faster and produce schedules of a comparable quality.
منابع مشابه
Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems
In this paper, we consider the problem of evaluating the worst case performance of flexible solutions in non-preemptive disjunctive scheduling. A flexible solution represents a set of semi-active schedules and is characterized by a partial order on each machine. A flexible solution can be used on-line to absorb the impact of some data disturbances related for example to job arrival, tool availa...
متن کاملUsing a Reflective Real-Time Operating System to Implement a Just-in-Time Scheduling Policy for a Flexible Manufacturing Workcell1
Research on the automated control of a flexible manufacturing workcell has generally assumed that there is a low-level computer system to control the machines, without addressing the precise functionality of this low-level system and how it might uniquely support the manufacture of products. This work addresses how Spring, a real-time operating system, can be used to implement a Just-In-Time (J...
متن کاملFlexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work is to provide the decision-maker a characterization of possible modifications of the predictive schedule while preserving optimality. In the context of machine scheduling, the anticipated modifications are changes in th...
متن کاملComposable Preemptive and Non-preemptive Real-time Scheduling Eliminating Component Overhead
Our work required a model for scheduling real-time tasks that extended the state of the art, supporting a flexible mix of preemptive and non-preemptive scheduling. Mixing these two kinds of scheduling is useful because preemption permits flexible allocation of CPU time while nonpreemptive scheduling has many benefits in software engineering (since race conditions become much more difficult to c...
متن کاملScheduling of flexible manufacturing systems using genetic algorithm: A heuristic approach
Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...
متن کامل